Regularly spaced subsums of integer partitions

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Subsums of Integer Partitions

Abstract For integer partitions λ : n = a1 + ...+ ak, where a1 ≥ a2 ≥ . . . ≥ ak ≥ 1, we study the sum a1 + a3 + . . . of the parts of odd index. We show that the average of this sum, over all partitions λ of n, is of the form n/2 + ( √ 6/(8π)) √ n log n+ c2,1 √ n+O(log n). More generally, we study the sum ai + am+i + a2m+i + . . . of the parts whose indices lie in a given arithmetic progressio...

متن کامل

Integer Partitions with Fixed Subsums

Given two positive integers m ≤ n, we consider the set of partitions λ = (λ1, . . . , λ`, 0, . . . ), λ1 ≥ λ2 ≥ . . . , of n such that the sum of its parts over a fixed increasing subsequence (aj) is m: λa1 + λa2 + · · · = m. We show that the number of such partitions does not depend on n if m is either constant and small relatively to n or depend on n but is close to its largest possible value...

متن کامل

Integer Partitions

Let  denote the positive octant of the regular -dimensional cubic lattice. Each vertex (1 2     ) of  is adjacent to all vertices of the form (1 2      + 1     ), 1 ≤  ≤ . A -partition of a positive integer  is an assignment of nonnegative integers 12 to the vertices of , subject to both an ordering condition 12 ≥ max 1≤≤ 12+...

متن کامل

Intersecting integer partitions

If a1, a2, . . . , ak and n are positive integers such that n = a1+a2+· · ·+ak, then the sum a1 + a2 + · · ·+ ak is said to be a partition of n of length k, and a1, a2, . . . , ak are said to be the parts of the partition. Two partitions that differ only in the order of their parts are considered to be the same partition. Let Pn be the set of partitions of n, and let Pn,k be the set of partitio...

متن کامل

Lectures on Integer Partitions

2000, under the auspices of the Pacific Institute for the Mathematical Sciences. My original intent was to describe the sequence of developments which began in the 1980's and has led to a unified and automated approach to finding partition bijections. These developments, of six papers, in fact form much of the content of these notes, but it seemed desirable to preface them with some general bac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Acta Arithmetica

سال: 2004

ISSN: 0065-1036,1730-6264

DOI: 10.4064/aa115-3-1